package Practice02;
//判断2--100之间的素数
public class PrimeNumber {
    public static void main(String[] args) {

        for (int i = 2; i <=100 ; i++) {
            boolean b = true;
            for (int j = 2; j <=i/2 ; j++) {
                if (i%j==0){
                    b = false;
                    break;
                }
            }
            if (b) {
                System.out.println(i+"是素数");
            }
        }


    }
}
